BUILDING A POLYNOMIAL FUNCTION FROM FIXED POINTS GIVEN PREVIOUSLY
نویسندگان
چکیده
منابع مشابه
How Many Real Attractive Fixed Points Can A Polynomial Have?
We prove a complex polynomial of degree n has at most ⌈n/2⌉ attractive fixed points lying on a line. We also consider the general case.
متن کاملCounting Points of Fixed Degree and given Height over Function Fields
Let k be a finite algebraic extension of the field of rational functions in one indeterminate over a finite field and let k denote an algebraic closure of k. We count points in projective space Pn−1(k) with given height and generating an extension of fixed degree d over k. If n > 2d + 3 we derive an asymptotic estimate for the number of such points as the height tends to infinity. As an applica...
متن کاملPolynomial Algorithm for Fixed Points of Nontrivial Morphisms
A word w is a fixed point of a nontrival morphism h if w = h(w) and h is not the identity on the alphabet of w. The paper presents the first polynomial algorithm deciding whether a given word is such a fixed point. The algorithm also constructs the corresponding morphism, which has the smallest possible number of non-erased letters.
متن کاملLeast and greatest fixed points of a while semantics function
The meaning of a program is given by specifying the function (from input to output) that corresponds to the program. The denotational semantic definition, thus maps syntactical things into functions. A relational semantics is a mapping of programs to relations. We consider that the input-output semantics of a program is given by a relation on its set of states. In a nondeterministic context, th...
متن کاملDiagonal arguments and fixed points
A universal schema for diagonalization was popularized by N.S. Yanofsky (2003), based on a pioneering work of F.W. Lawvere (1969), in which the existence of a (diagonolized-out and contradictory) object implies the existence of a fixed-point for a certain function. It was shown that many self-referential paradoxes and diagonally proved theorems can fit in that schema. Here, we fi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Selecciones Matemáticas
سال: 2015
ISSN: 2411-1783
DOI: 10.17268/sel.mat.2015.01.06